Pairwise complete regularity as a separation axiom

Axiom Schema Of Separation

following are the axioms of Zermelo and Fraenkel minus the axiom of infinity. (1). Schema of Specification (separation, restricted comprehension). Let φ(x, p). I am slightly confused since in the notes we are only really given the definition of the Axiom Schema of Separation and then there are no real examples. reject (e.g., Kripke's Schema) and is falsified outright by principles. (Church's Th...

The Priestley Separation Axiom for Scattered Spaces

Let R be a quasi-order on a compact Hausdorff topological space X. We prove that if X is scattered, then R satisfies the Priestley separation axiom if and only if R is closed in the product space X × X. Furthermore, if X is not scattered, then we show that there is a quasi-order on X that is closed in X × X but does not satisfy the Priestley separation axiom. As a result, we obtain a new charac...

A Constructive View of Complete Regularity

A complete axiom system for finite-state probabilistic processes

A complete equational axiomatization of probabilistic bisimulation for nite-state probabilistic processes is presented. It extends Milner's complete axiomatiza

Regularity of BPP is PSPACE-complete

Jančar has in 2003 shown that bisimilarity on Basic Parallel Processes (BPP) can be decided in polynomial space. But bisimilarity is studied also on various subclasses of BPP. We present summary of known complexity bounds of some such bisimilarity problems. Moreover is here shown that deciding regularity of a BPP is PSPACE-complete. This result was presented at winter school Movep’04 in PhD stu...